Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem
نویسندگان
چکیده
منابع مشابه
Lecture 2 Svp, Gram-schmidt, Lll 1 Shortest Vector Problem
Last time we defined the minimum distance λ1(L) of a lattice L, and showed that it is upper bounded by √ n · det(L)1/n (Minkowski’s theorem), but this bound is often very loose. Some natural computational questions are: given a lattice (specified by some arbitrary basis), can we compute its minimum distance? Can we find a vector that achieves this distance? Can we find good approximations to th...
متن کاملTwo-Cloud-Servers-Assisted Secure Outsourcing Multiparty Computation
We focus on how to securely outsource computation task to the cloud and propose a secure outsourcing multiparty computation protocol on lattice-based encrypted data in two-cloud-servers scenario. Our main idea is to transform the outsourced data respectively encrypted by different users' public keys to the ones that are encrypted by the same two private keys of the two assisted servers so that ...
متن کاملAn Efficient and Secure Nonlinear Programming Outsourcing in Cloud Computing
Cloud Computing provides a appropriate on-demand network access to a shared pool of configurable computing resources which could be rapidly deployed with much more great efficiency and with minimal overhead to management. This paper deals with the secure outsourcing of nonlinear programming. It provides a practical mechanism design which fulfils input/output privacy, cheating resilience, and ef...
متن کاملA Three-Level Sieve Algorithm for the Shortest Vector Problem
In AsiaCCS 2011, Wang et al. proposed a two-level heuristic sieve algorithm for the shortest vector problem in lattices, which improves the Nguyen-Vidick sieve algorithm. Inspired by their idea, we present a three-level sieve algorithm in this paper, which is shown to have better time complexity. More precisely, the time complexity of our algorithm is 2 polynomial-time operations and the corres...
متن کاملApproximation Algorithm for the Shortest Approximate Common Superstring Problem
The Shortest Approximate Common Superstring (SACS) problem is : Given a set of strings f={w1, w2, ... , wn}, where no wi is an approximate substring of wj, i ≠ j, find a shortest string Sa, such that, every string of f is an approximate substring of Sa. When the number of the strings n>2, the SACS problem becomes NP-complete. In this paper, we present a greedy approximation SACS algorithm. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-93206-0_14